Normal view MARC view ISBD view

Cryptography

By: Rubinstein-Salzedo, Simon.
Series: Springer undergraduate mathematics series.Publisher: Cham : Springer, 2018Description: xii, 259 p. ; ill., 24 cm.ISBN: 9783319948171.Subject(s): Cryptography | Number theory | Autokey cipher | Baby-step giant step algorithm | Caesar cipher | Ciphertext | Diffie-Hellman key exchange | El Gamel cryptosystem | Fermat's Little theorem | Gross-Zagier formula | Hill cipher | Kerckhoff's principle | Lagrangeb interpolation formula | Combinatorial analysis | Subsititution cipher | Tunnell's theorem | Vigenere cipher | Zero knowledge proofDDC classification: 652.8 Summary: This text introduces cryptography, from its earliest roots to cryptosystems used today for secure online communication. Beginning with classical ciphers and their cryptanalysis, this book proceeds to focus on modern public key cryptosystems such as Diffie-Hellman, ElGamal, RSA, and elliptic curve cryptography with an analysis of vulnerabilities of these systems and underlying mathematical issues such as factorization algorithms. Specialized topics such as zero knowledge proofs, cryptographic voting, coding theory, and new research are covered in the final section of this book. Aimed at undergraduate students, this book contains a large selection of problems, ranging from straightforward to difficult, and can be used as a textbook for classes as well as self-study. Requiring only a solid grounding in basic mathematics, this book will also appeal to advanced high school students and amateur mathematicians interested in this fascinating and topical subject.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books 652.8 RUB (Browse shelf) Available 034095

Includes bibliographical references and index.

This text introduces cryptography, from its earliest roots to cryptosystems used today for secure online communication. Beginning with classical ciphers and their cryptanalysis, this book proceeds to focus on modern public key cryptosystems such as Diffie-Hellman, ElGamal, RSA, and elliptic curve cryptography with an analysis of vulnerabilities of these systems and underlying mathematical issues such as factorization algorithms. Specialized topics such as zero knowledge proofs, cryptographic voting, coding theory, and new research are covered in the final section of this book. Aimed at undergraduate students, this book contains a large selection of problems, ranging from straightforward to difficult, and can be used as a textbook for classes as well as self-study. Requiring only a solid grounding in basic mathematics, this book will also appeal to advanced high school students and amateur mathematicians interested in this fascinating and topical subject.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha